Models of Blocking Probability in All-Optical Networks with and without Wavelength Changers
نویسندگان
چکیده
We introduce a tra c model for circuit switched alloptical networks (AONs) which we then use to calculate the blocking probability along a path for networks with and without wavelength changers. We investigate the e ects of path length, switch size, and interference length (the expected number of hops shared by two sessions which share at least one hop) on blocking probability and the ability of wavelength changers to improve performance. Our model correctly predicts unobvious qualitative behavior demonstrated in simulations by other authors.
منابع مشابه
Models of Blocking Probability in All-Optical Networks with and Without Wavelength Changers - Selected Areas in Communications, IEEE Journal on
We introduce a traffic model for circuit-switched all-optical networks which we then use to calculate the blocking probability along a path for networks with and without wavelength changers. We investigate the effects of path length, switch size, and interference length (the expected number of hops shared by two sessions which share at least one hop) on blocking probability and the ability of w...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملWavelength Routing for All - Optical Networks 1 Richard
We consider passive all-optical networks using wavelength division multiplexing and wavelength routing, i.e. the path of a signal is determined by the wavelength of the signal and the signal origin. We present upper and lower bounds on the required number of wavelengths to achieve a given blocking probability. Speciically we show that between ?p M (1?P b) and O ?p M wavelengths are required to ...
متن کاملProof: for Any Connection Set with Load L and All Path- Lengths No Greater than L, We Construct the Path-conflict Graph. Each Connection Shares a Link with at Most L(l ? 1)
others. So the degree of path-conflict graph is at most l(L ? 1). Then we need at most l(L ? 1) + 1 colors for vertex-coloring the path-conflict graph. So !(1) l(L?1). By the first lemma, !(k) d(l(L ? 1) + 1)=ke. 8 Conclusion In this paper, we considered the wavelength assignment problem in multifiber networks, in which each link has exactly k parallel fibers. Our results for star and ring netw...
متن کاملRouting and wavelength assignment strategies in optical networks
We consider the routing and wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) networks without wavelength conversion. When the physical network and required connections are given, RWA is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Journal on Selected Areas in Communications
دوره 14 شماره
صفحات -
تاریخ انتشار 1995